Heuristic Constraint Propagation Using Local Search for Incomplete Pruning and Domain Filtering of Redundant Constraints for the Social Golfer Problem
نویسنده
چکیده
منابع مشابه
Randomised Backtracking for Linear Pseudo-Boolean Constraint Problems
Many constraint satisfaction and optimisation problems can be expressed using linear constraints on pseudo-Boolean (0/1) variables. Problems expressed in this form are usually solved by integer programming techniques, but good results have also been obtained using generalisations of SAT algorithms based on both backtracking and local search. A recent class of algorithm uses randomised backtrack...
متن کاملDecomposition During Search for Propagation-Based Constraint Solvers
We describe decomposition during search (DDS), an integration of and/or tree search into propagation-based constraint solvers. The presented search algorithm dynamically decomposes sub-problems of a constraint satisfaction problem into independent partial problems, avoiding redundant work. The paper discusses how DDS interacts with key features that make propagation-based solvers successful: co...
متن کاملAn effective greedy heuristic for the Social Golfer Problem
Abstract The Social Golfer Problem (SGP) is a combinatorial optimization problem that exhibits a lot of symmetry and has recently attracted significant attention. In this paper, we present a new greedy heuristic for the SGP, based on the intuitive concept of freedom among players. We use this heuristic in a complete backtracking search, and match the best current results of constraint solvers f...
متن کاملBoosting Set Constraint Propagation for Network Design
This paper reconsiders the deployment of synchronous optical networks (SONET), an optimization problem naturally expressed in terms of set variables. Earlier approaches, using either MIP or CP technologies, focused on symmetry breaking, including the use of SBDS, and the design of effective branching strategies. This paper advocates an orthogonal approach and argues that the thrashing behavior ...
متن کاملHeuristics for dynamically adapting propagation in constraint satisfaction problems
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt the propagation method applied on the constraints of the problem during search. In this paper we present a heuristic approach to this problem based on the monitoring of propagation events like value deletions and domain ...
متن کامل